Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое lazy evaluation - определение
EVALUATION STRATEGY THAT DELAYS EVALUATION OF EXPRESSIONS UNTIL ACTUALLY NEEDED
Call by need; Lazy Evaluation; Short circuit (programming); Infinite list; Infinite lists; Lazy evalution; Lazy eval; Lazily evaluated language; Lazy allocation
Найдено результатов: 400
lazy evaluation
<reduction> An evaluation strategy combining {normal order
evaluation} with updating. Under normal order evaluation
(outermost or call-by-name evaluation) an expression is
evaluated only when its value is needed in order for the
program to return (the next part of) its result. Updating
means that if an expression's value is needed more than once
(i.e. it is shared), the result of the first evaluation is
remembered and subsequent requests for it will return the
remembered value immediately without further evaluation. This
is often implemented by graph reduction. An unevaluated
expression is represented as a closure - a data structure
containing all the information required to evaluate the
expression.
Lazy evaluation is one evaluation strategy used to implement
non-strict functions. Function arguments may be infinite
data structures (especially lists) of values, the components
of which are evaluated as needed.
According to Phil Wadler the term was invented by Jim Morris.
Opposite: eager evaluation.
A partial kind of lazy evaluation implements lazy data
structures or especially lazy lists where function arguments
are passed evaluated but the arguments of data constructors
are not evaluated.
Full laziness is a program transformation which aims to
optimise lazy evaluation by ensuring that all subexpressions
in a function body which do not depend on the function's
arguments are only evaluated once.
(1994-12-14)
Lazy evaluation
In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (sharing).
Lazy (Orlová)
PART OF ORLOVÁ
Lazy (Orlova)
(Polish: ) is a village in Karviná District, Moravian-Silesian Region, Czech Republic. It was a separate municipality but became administratively a part of Orlová in 1946.
Lazy Susan
![Finnish]] carpenter Ikahainen.<ref>[http://www.russianmuseums.info/M267 Repin "Penaty" Estate in Repino/Kuokkala, Russia, currently a museum].</ref>](https://commons.wikimedia.org/wiki/Special:FilePath/Репин. Пенаты. Интерьеры.JPG?width=200 "Finnish]] carpenter Ikahainen.<ref>[http://www.russianmuseums.info/M267 Repin \"Penaty\" Estate in Repino/Kuokkala, Russia, currently a museum].</ref>")
TURNTABLE PLACED ON A TABLE OR COUNTERTOP TO AID IN DISTRIBUTING FOOD
Lazy susan; Lazy Suzy; Cake turntable
A Lazy Susan is a turntable (rotating tray) placed on a table or countertop to aid in distributing food. Lazy Susans may be made from a variety of materials but are usually glass, wood, or plastic.
lazy Susan
TURNTABLE PLACED ON A TABLE OR COUNTERTOP TO AID IN DISTRIBUTING FOOD
Lazy susan; Lazy Suzy; Cake turntable
¦ noun a revolving stand or tray on a table, used especially for holding condiments.
Lazy loading
DESIGN PATTERN IN COMPUTER PROGRAMMING
Lazy load
Lazy loading (also known as asynchronous loading) is a design pattern commonly used in computer programming and mostly in web design and development to defer initialization of an object until the point at which it is needed. It can contribute to efficiency in the program's operation if properly and appropriately used.
Lazy river
ORIGINAL SONG WRITTEN AND COMPOSED BY SIDNEY ARODIN AND HOAGY CARMICHAEL
Lazy River (song); Lazy River; Up a Lazy River; Up A Lazy River; (Up a) Lazy River
A lazy river is a water ride found in water parks, hotels, resorts, and recreation centers, which usually consists of a shallow () pool that flows similarly to a river.
(Up A) Lazy River
ORIGINAL SONG WRITTEN AND COMPOSED BY SIDNEY ARODIN AND HOAGY CARMICHAEL
Lazy River (song); Lazy River; Up a Lazy River; Up A Lazy River; (Up a) Lazy River
"(Up A) Lazy River" is a popular tune and song by Hoagy Carmichael and Sidney Arodin, published in 1930. The melody is by Arodin, arranged and with words modified by Carmichael.
Evaluation function
FUNCTION RETURNING ESTIMATED VALUE OF A POSITION IN A GAME PLAYING PROGRAM
Static evaluation function; Heuristic evaluation function; Piece-square table
An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs to estimate the value or goodness of a position (usually at a leaf or terminal node) in a game tree. Most of the time, the value is either a real number or a quantized integer, often in nths of the value of a playing piece such as a stone in go or a pawn in chess, where n may be tenths, hundredths or other convenient fraction, but sometimes, the value is an array of three values in the unit interval, representing the win, draw, and loss percentages of the position.
Course evaluation
QUESTIONNAIRE COMPLETED BY STUDENTS TO EVALUATE AN ACADEMIC COURSE
Course evaluations; Student evaluations; Training Evaluation; Trainer Evaluation; Student Evaluation; Instructor Evaluation; Learning evaluation
A course evaluation is a paper or electronic questionnaire, which requires a written or selected response answer to a series of questions in order to evaluate the instruction of a given course. The term may also refer to the completed survey form or a summary of responses to questionnaires.
Википедия
Lazy evaluation
In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (sharing).
The benefits of lazy evaluation include:
- The ability to define control flow (structures) as abstractions instead of primitives.
- The ability to define potentially infinite data structures. This allows for more straightforward implementation of some algorithms.
- The ability to define partially-defined data structures where some elements are errors. This allows for rapid prototyping.
Lazy evaluation is often combined with memoization, as described in Jon Bentley's Writing Efficient Programs. After a function's value is computed for that parameter or set of parameters, the result is stored in a lookup table that is indexed by the values of those parameters; the next time the function is called, the table is consulted to determine whether the result for that combination of parameter values is already available. If so, the stored result is simply returned. If not, the function is evaluated and another entry is added to the lookup table for reuse.
Lazy evaluation is difficult to combine with imperative features such as exception handling and input/output, because the order of operations becomes indeterminate.
The opposite of lazy evaluation is eager evaluation, sometimes known as strict evaluation. Eager evaluation is the evaluation strategy employed in most programming languages.
